Simulating Network Coding for Accelerating Tit-for-Tat in Peer-to-Peer Content Sharing
نویسندگان
چکیده
The deterministic network coding has several advantages over random network coding methods, like lower communication overhead and faster linear independence check. We would like to create a P2P content sharing simulation environment, where nodes communicate with deterministic network coding to observe the different properties of deterministic source coding. Our simulator is based on the Peersim generic P2P simulation framework. We examine the diversity of block combinations, as this property is the key for increasing the P2P network reliability.
منابع مشابه
Honor Among Thieves — A Source Coding Based Sharing Mechanism for the BitThief Client
In this thesis, the implementation of a peer-to-peer data distribution system called T4T is discussed. T4T is based on a truly fair tit-for-tat exchange of data blocks between peers. To circumvent the inherent problems of strict tit-for-tat, source coding of the original data is employed. As only linear combinations of blocks are ever transmitted, the block diversity in the network is greatly i...
متن کاملAnalyzing and Improving BitTorrent Performance
In recent years, BitTorrent has emerged as a very popular and scalable peer-to-peer file distribution mechanism. It has been successful at distributing large files quickly and efficiently without overwhelming the capacity of the origin server. Early measurement studies verified that BitTorrent achieves excellent upload utilization, but raised several questions concerning utilization in settings...
متن کاملFree Riding in BitTorrent and Countermeasures
We show that, contrary to common belief, free riding is indeed possible in BitTorrent. We present a BitTorrent client implementation in Java which successfully downloads shared files without ever contributing a single byte of user data to the network. Surprisingly, this client often achieves the same download speed as the original BitTorrent client. This client is of particular interest for peo...
متن کاملEnhancing tit-for-tat for incentive in BitTorrent networks
BitTorrent achives great success in its high performance for file distribution. It is commonly believed that this owes to Tit-for-Tat strategy adopted in choking algorithm for incentive in BitTorrent protocol. But there are still many issues in incentive mechanism in BitTorrent. In this paper, we study Tit-for-Tat strategy by constructing a game model in P2P environments and deducing the constr...
متن کاملToward Efficient On-Demand Streaming with BitTorrent
This paper considers the problem of adapting the BitTorrent protocol for on-demand streaming. BitTorrent is a popular peer-to-peer file sharing protocol that efficiently accommodates a large number of requests for file downloads. Two components of the protocol, namely the rarest-first piece selection policy and the tit-for-tat algorithm for peer selection, are acknowledged to contribute toward ...
متن کامل